618B - Guess the Permutation - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;

#define ff first
#define ss second
#define endl "\n"
#define pb push_back
#define int long long
#define mod  1000000007
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define fill(a,b) memset(a,b,sizeof(a))
void solve()
{
    int n;cin>>n;
    vector<pair<int,map<int,int>>>v(n);
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            int x;cin>>x;
            v[i].ss[x]++;
        }
    }
    int b[n]={0};
    int vis[n+1]={0};
    for(int i=0;i<n;i++)
    {
        for(auto it:v[i].ss)
        {
            if(it.ss>1)
            {
                b[i]=it.ff;
                vis[it.ff]++;
                break;
            }
        }
    }
    for(int i=0;i<n;i++)
    {
        if(b[i]==0)
        {
            for(int j=1;j<=n;j++)
            {
                if(vis[j]==0)
                {
                    b[i]=j;
                    vis[j]++;
                    break;
                }
            }
        }
    }
    for(auto it:b)cout<<it<<" ";
    cout<<endl;
}
int32_t main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T=1;
    //cin>>T;
    while(T--)
        solve();
    return 0;
}